Relaxation and Decomposition Methods
نویسندگان
چکیده
This book is concerned with theory, algorithms and software for solving nonconvex mixed integer nonlinear programs. It consists of two parts. The first part describes basic optimization tools, such as block-separable reformulations, convex and Lagrangian relaxations, decomposition methods and global optimality criteria. The second part is devoted to algorithms. Starting with a short overview on existing methods, we present deformation, rounding, partitioning and Lagrangian heuristics, and a branch-cut-and-price algorithm. The algorithms are implemented as part of an object-oriented library, called LaGO. We report numerical results on several mixed integer nonlinear programs to show abilities and limits of the proposed solution methods.
منابع مشابه
Decomposition and Dynamic Cut Generation in Integer Programming
Decomposition algorithms such as Lagrangian relaxation and Dantzig-Wolfe decomposition are well-known methods that can be used to develop bounds for integer programming problems. We draw connections between these classical approaches and techniques based on generating strong valid inequalities. We also discuss several methods for incorporating dynamic cut generation into traditional decompositi...
متن کاملDecomposition and Dynamic Cut Generation in Integer Linear Programming
Decomposition algorithms such as Lagrangian relaxation and Dantzig-Wolfe decomposition are well-known methods that can be used to generate bounds for mixed-integer linear programming problems. Traditionally, these methods have been viewed as distinct from polyhedral methods, in which bounds are obtained by dynamically generating valid inequalities to strengthen a linear programming relaxation. ...
متن کاملSchwarz Waveform Relaxation Method for the Viscous Shallow Water Equations
We are interested in solving time dependent problems using domain decomposition method. In the classical methods, one discretizes first the time dimension and then one solves a sequence of steady problems by a domain decomposition method. In this paper, we study a Schwarz Waveform Relaxation method which treats directly the time dependent problem. We propose algorithms for the viscous Shallow W...
متن کاملDecomposition and Dynamic Cut Generation in Integer Programming: Theory and Algorithms
Decomposition algorithms such as Lagrangian relaxation and Dantzig-Wolfe decomposition are well-known methods that can be used to compute bounds for integer programming problems. We discuss a framework for integrating dynamic cut generation with traditional decomposition methods in order to obtain improved bounds and present a new paradigm for separation called decompose and cut. The methods we...
متن کاملConvergence of the domain decomposition finite element–boundary element coupling methods
In this work, we analyze three available domain decomposition methods. We also establish the convergence conditions. The theoretical analysis provides an interval in which a relaxation parameter has to be chosen in order to achieve convergence. Moreover, it allows the selection of the relaxation parameter so that convergence is achieved with the minimum number of iterations. Several example pro...
متن کاملA Domain Decomposition Method Combining a Boundary Element Method with a Meshless Local Petrov-Galerkin Method
A non-overlapping domain decomposition algorithm combining boundary element method with meshless local Petrov-Galerkin method is presented for solving the boundary value problem with discontinuous coefficient in this paper. The static relaxation parameter is employed to speed up the convergence rate. The convergence range and the optimal value of static relaxation parameter are studied, but the...
متن کامل